A Process Calculus of Atomic Commit

نویسندگان

  • Laura Bocchi
  • Lucian Wischik
چکیده

This article points out a strong connection between process calculi and atomic commit. Process calculus rendezvous is an abstract semantics for atomic commitment. An implementation of process-calculus rendezvous is an atomic commit protocol. Thus, the traditional correctness properties for atomic commit are entailed by a bisimulation proof of a calculus implementation. Actually, traditional rendezvous as found in the pi calculus corresponds to just a special case of atomic commit called a binary cohesion. If we take the general case of atomic commit, this induces a richer form of calculus rendezvous similar to the join calculus [10]. As an extended example of the analogy between calculus and atomic commit, we use the induced calculus to reformulate an earlier 2PCP correctness result by Berger and Honda [1].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Atomic Commit and Negotiation in Service Oriented Computing

We discuss the relationship between two coordination problems in the context of Service Oriented Computing: atomic commit and negotiation. The atomic commit is a well known problem addressing the agreement of a number of distributed participants to achieve a global outcome, typically commit or abort. Negotiation addresses the enactment of a multi-step interaction among a number of parties in or...

متن کامل

Constructing Atomic Commit Protocols Using Knowledge

use logic of process knowledge as a tool to (1) tomic commit problem, to (2) analyze at a rather correct atomic commit protocols that are in use and construction of atomic commit protocols. This e formal definitions are introduced and used in the for people not familiar with logic of process rotocols. ment in supporting global atomicity of distributed (2PC) is the de facto standard atomic commi...

متن کامل

Analysis and Verification of Two-Phase Commit & Three-Phase Commit Protocols

This paper introduces a formal model of the distributed commit protocols in the process algebra mCRL2 and also their general requirements in the modal μ-calculus. We show how to make straightforward models of protocols and by doing so, how it becomes easy to identify problems. We apply this to the well-known Two-Phase Commit Protocol (2PC) and prove it problematic for single site failure. We al...

متن کامل

Fast non-blocking atomic commit: an inherent trade-off

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes “no,” and the fast commit property, i.e., committing a transactio...

متن کامل

Non-Blocking Atomic Commitment with an Unreliable Failure Detector

In a transactional system, an atomic commitment protocol ensures that for any transaction , all Data Manager processes agree on the same outcome (commit or abort). A non-blocking atomic commitment protocol enables an outcome to be decided at every correct process despite the failure of others. In this paper we apply, for the rst time, the fundamental result of Chandra and Toueg on solving the a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 105  شماره 

صفحات  -

تاریخ انتشار 2004